Image registration methods in high-dimensional space

نویسندگان

  • Huzefa Neemuchwala
  • Alfred O. Hero
  • Sakina Zabuawala
  • Paul L. Carson
چکیده

Quantitative evaluation of similarity between feature densities of images is an important step in several computer vision and data-mining applications such as registration of two or more images and retrieval and clustering of images. Previously we had introduced a new class of similarity measures based on entropic graphs to estimate Rènyi’s a-entropy, a-Jensen difference divergence, a-mutual information, and other divergence measures for image registration. Entropic graphs such as the minimum spanning tree (MST) and k-Nearest neighbor (kNN) graph allow the estimation of such similarity measures in higher dimensional feature spaces. A major drawback of histogrambased estimates of such measures is that they cannot be reliably constructed in higher dimensional feature spaces. In this article, we shall briefly extrapolate upon the use of entropic graph based divergence measures mentioned above. Additionally, we shall present estimates of other divergence viz the GeometricArithmetic mean divergence and Henze–Penrose affinity. We shall present the application of these measures for pairwise image registration using features derived from independent component analysis of the images. An extension of pairwise image registration is to simultaneously register multiple images, a challenging problem that arises while constructing atlases of organs in medical imaging. Using entropic graph methods we show the feasibility of such simultaneous registration using graph based higher dimensional estimates of entropy measures. Finally we present a new nonlinear correlation measure that is invariant to nonlinear transformations of the underlying feature space and can be reliably constructed in higher dimensions. We present an image clustering experiment to demonstrate the robustness of this measure to nonlinear transformations and contrast it with the clustering performance of the linear correlation coefficient. VC 2007 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 16, 130– 145, 2006; Published online in Wiley InterScience (www.interscience.wiley. com). DOI 10.1002/ima.20079

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Subsampling Method for 3D Multimodality Medical Image Registration Based on Mutual Information

Mutual information (MI) is a widely used similarity metric for multimodality image registration. However, it involves an extremely high computational time especially when it is applied to volume images. Moreover, its robustness is affected by existence of local maxima. The multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

متن کامل

Methods to evaluate the performance of kilovoltage cone-beam computed tomography in the three-dimensional reconstruction space

Background: Cone-beam computed tomography (CBCT) scanners for image-guided radiotherapy are in clinical use today, but there has been no consensus on uniform acceptance to verify the CBCT image quality yet. The present work proposed new methods to fully evaluate the performance of CBCT in its three-dimensional (3D) reconstruction space. Materials and Methods: Compared to the traditional methods...

متن کامل

Contourlet-Based Edge Extraction for Image Registration

Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. In general, the majority of registration methods consist of the following four steps: feature extraction, feature matching, transform modeling, and finally image resampling. As the accuracy of a registration process is highly dependent to the fe...

متن کامل

DPML-Risk: An Efficient Algorithm for Image Registration

Targets and objects registration and tracking in a sequence of images play an important role in various areas. One of the methods in image registration is feature-based algorithm which is accomplished in two steps. The first step includes finding features of sensed and reference images. In this step, a scale space is used to reduce the sensitivity of detected features to the scale changes. Afterw...

متن کامل

A Study on Robustness of Various Deformable Image Registration Algorithms on Image Reconstruction Using 4DCT Thoracic Images

Background: Medical image interpolation is recently introduced as a helpful tool to obtain further information via initial available images taken by tomography systems. To do this, deformable image registration algorithms are mainly utilized to perform image interpolation using tomography images.Materials and Methods: In this work, 4DCT thoracic images of five real patients provided by DI...

متن کامل

یک روش مبتنی بر خوشه‌بندی سلسله‌مراتبی تقسیم‌کننده جهت شاخص‌گذاری اطلاعات تصویری

It is conventional to use multi-dimensional indexing structures to accelerate search operations in content-based image retrieval systems. Many efforts have been done in order to develop multi-dimensional indexing structures so far. In most practical applications of image retrieval, high-dimensional feature vectors are required, but current multi-dimensional indexing structures lose their effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Imaging Systems and Technology

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2006